Tape-bounded turing acceptors and principal AFLs
نویسندگان
چکیده
منابع مشابه
Tape-Reversal Bounded Turing Machine Computations
This paper studies the classification of recursive sets by the number of tape reversals required for their recognition on a two-tape Turing machine with a one-way input tape. This measure yields a rich hierarchy of tape-reversal limited complexity classes and their properties and ordering are investigated. The most striking difference between this and the previously studied complexity measures ...
متن کاملNondeterministic One-Tape Off-Line Turing Machines
Finite state control Semi-infinite tape which contains, at the beginning of the computation: the input string, on its part of the tape the blank symbol, in the remaining squares According to the transition function at each step the machine: changes its internal state writes a nonblank symbol on the scanned tape square moves the head either to the left, or to the right, or keeps it on the same s...
متن کاملA formalization of multi-tape Turing machines
We discuss the formalization, in the Matita Theorem Prover, of basic results on multi-tapes Turing machines, up to the existence of a (certified) Universal Machine, and propose it as a natural benchmark for comparing different interactive provers and assessing the state of the art in the mechanization of formal reasoning. The work is meant to be a preliminary step towards the creation of a form...
متن کاملOne-Tape, Off-Line Turing Machine Computations
In this paper we shall consider Turing machines tha t can, at any given step in their computations, do each of the following things: (a) change the tape symbols currently scanned by their reading heads, (b) shift each of their tapes one square to the left or right, (c) change their internal state, and (d) halt. Each step is assumed to require exactly one t ime unit for its completion. I n order...
متن کاملSymmetries and transitions of bounded Turing machines
We consider the structures given by repeatedly generalising the definition of finite state automata by symmetry considerations, and constructing analogues of the transition monoid at each step. This approach first gives us non-deterministic automata, then (non-deterministic) two-way automata and bounded Turing machines — that is, Turing machines where the read / write head is unable to move pas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1970
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(70)80032-0